The lollipop graph is determined by its Q-spectrum
نویسندگان
چکیده
منابع مشابه
The Lollipop Graph is Determined by its Spectrum
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X. Liu and Y. Zhang for the even lollipop. We revisit the proof for odd lollipop, generalize it for even lollipop and therefore answer the question. O...
متن کاملErratum to "The lollipop graph is determined by its Q-spectrum"
A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q , any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex of a path Pn−p. In this paper, it is proved that all lollipop graphs are determined by their Q -spectra. © 2008 Elsevier B.V. All rights r...
متن کاملQuasirecognition by the prime graph of L_3(q) where 3 < q < 100
Let $G$ be a finite group. We construct the prime graph of $ G $,which is denoted by $ Gamma(G) $ as follows: the vertex set of thisgraph is the prime divisors of $ |G| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ G $ contains anelement of order $ pq $.In this paper, we determine finite groups $ G $ with $ Gamma(G) =Gamma(L_3(q)) $, $2 leq q < 100 $ and prov...
متن کاملCHARACTERIZATION OF SL(2, q) BY ITS NON-COMMUTING GRAPH
Let G be a non-abelian group and Z(G) be its center. The non-commuting graph AG of G is the graph whose vertex set is G\Z(G) and two vertices are joined by an edge if they do not commute. Let SL(2, q) be the special linear group of degree 2 over the finite field of order q. In this paper we prove that if G is a group such that AG ∼= ASL(2,q) for some prime power q ≥ 2, then G ∼= SL(2, q). MSC 2...
متن کاملquasirecognition by the prime graph of l_3(q) where 3 < q < 100
let $g$ be a finite group. we construct the prime graph of $ g $,which is denoted by $ gamma(g) $ as follows: the vertex set of thisgraph is the prime divisors of $ |g| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ g $ contains anelement of order $ pq $.in this paper, we determine finite groups $ g $ with $ gamma(g) =gamma(l_3(q)) $, $2 leq q < 100 $ and prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.09.052